Greedy Randomized Gauss-Seidel Method with Oblique Direction
نویسندگان
چکیده
For the linear least squares problem with coefficient matrix columns being highly correlated, we develop a greedy randomized Gauss-Seidel method oblique direction. Then corresponding convergence result is deduced. Numerical examples demonstrate that our proposed superior to and
منابع مشابه
Paving the Randomized Gauss-Seidel
The Randomized Gauss-Seidel Method (RGS) is an iterative algorithm that solves overdetermined systems of linear equations Ax = b. This paper studies an update on the RGS method, the Randomized Block Gauss-Seidel Method(RBGS). At each step, the algorithm greedily minimizes the objective function L(x) = kAx bk2 with respect to a subset of coordinates. This paper describes a Randomized Block Gauss...
متن کاملGauss-Seidel method for multi-valued inclusions with Z mappings
We consider a problem of solution of a multi-valued inclusion on a cone segment. In the case where the underlying mapping possesses Z type properties we suggest an extension of Gauss-Seidel algorithms from nonlinear equations. We prove convergence of a modified double iteration process under rather mild additional assumptions. Some results of numerical experiments are also presented.
متن کاملD-iteration method or how to improve Gauss-Seidel method
The aim of this paper is to present the recently proposed fluid diffusion based algorithm in the general context of the matrix inversion problem associated to the Gauss-Seidel method. We explain the simple intuitions that are behind this diffusion method and how it can outperform existing methods. Then we present some theoretical problems that are associated to this representation as open resea...
متن کاملPreconditioned Gauss-seidel Iterative Method for Z-matrices Linear Systems
For Ax = b, it has recently been reported that the convergence of the preconditioned Gauss-Seidel iterative method which uses a matrix of the type P = I + S (α) to perform certain elementary row operations on is faster than the basic Gauss-Seidel method. In this paper, we discuss the adaptive Gauss-Seidel iterative method which uses P = I + S (α) + K̄ (β) as a preconditioner. We present some com...
متن کاملConvergence and Comparison Theorems of the Modified Gauss-Seidel Method
In this paper, the modified Gauss-Seidel method with the new preconditioner for solving the linear system Ax = b, where A is a nonsingular M -matrix with unit diagonal, is considered. The convergence property and the comparison theorems of the proposed method are established. Two examples are given to show the efficiency and effectiveness of the modified Gauss-Seidel method with the presented n...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Applied Mathematics and Physics
سال: 2023
ISSN: ['2327-4379', '2327-4352']
DOI: https://doi.org/10.4236/jamp.2023.114068